例句與造句

1. Convex programming problem
   凸規(guī)劃問題
2. Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem
   最后，還證明了得到的凹規(guī)劃和反凸規(guī)劃的全局最優(yōu)解就是原問題的近似全局最優(yōu)解。
3. Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem
   摘要首先將一個具有多個約束的規(guī)劃問題轉(zhuǎn)化為一個只有一個約束的規(guī)劃問題，然后通過利用這個單約束的規(guī)劃問題，對原來的多約束規(guī)劃問題提出了一些凸化、凹化的方法，這樣這些多約束的規(guī)劃問題可以被轉(zhuǎn)化為一些凹規(guī)劃、反凸規(guī)劃同題。
4. It's difficult to find convex programming problem in a sentence. 用convex programming problem造句挺難的